Counting Falsifying Assignments of Conjunctive Forms Using Binary Patterns

The representation of the set of falsifying assignments of clauses via binary patterns has been useful in the design of algorithms for solving #FAL (counting the number of falsifying assignments of conjunctive forms (CF)). Given as input a CF formula F expressed by m clauses defined over n variables, we present a deterministic algorithm for computing #SAT (F ). Initially, our algorithm computes non-intersecting subsets of falsifying assignments of F until the space of falsifying assignments defined by F is covered. Due to #SAT(F ) = 2-#FAL(F ), results about #FAL can be established dually for #SAT. The time complexity of our proposals for computing #SAT(F ) is established according with the number of clauses and the number of variables of F .